List-Coloring Graphs on Surfaces with Varying List-Sizes
نویسندگان
چکیده
منابع مشابه
List-Coloring Graphs on Surfaces with Varying List-Sizes
Let G be a graph embedded on a surface Sε with Euler genus ε > 0, and let P ⊂ V (G) be a set of vertices mutually at distance at least 4 apart. Suppose all vertices of G have H(ε)-lists and the vertices of P are precolored, where H(ε) = ⌊ 7+ √ 24ε+1 2 ⌋ is the Heawood number. We show that the coloring of P extends to a list-coloring of G and that the distance bound of 4 is best possible. Our re...
متن کاملList-coloring embedded graphs
For any fixed surface Σ of genus g, we give an algorithm to decide whether a graph G of girth at least five embedded in Σ is colorable from an assignment of lists of size three in time O(|V (G)|). Furthermore, we can allow a subgraph (of any size) with at most s components to be precolored, at the expense of increasing the time complexity of the algorithm to
متن کاملEquitable List Coloring of Graphs
A graph G is equitably k-choosable if, for any k-uniform list assignment L, G admits a proper coloring π such that π(v) ∈ L(v) for all v ∈ V (G) and each color appears on at most |G|/k vertices. It was conjectured in [8] that every graph G with maximum degree ∆ is equitably k-choosable whenever k ≥ ∆ + 1. We prove the conjecture for the following cases: (i) ∆ ≤ 3; (ii) k ≥ (∆ − 1). Moreover, eq...
متن کاملFive-list-coloring graphs on surfaces III. One list of size one and one list of size two
Let G be a plane graph with outer cycle C and let (L(v) : v ∈ V (G)) be a family of nonempty sets. By an L-coloring of G we mean a (proper) coloring φ of G such that φ(v) ∈ L(v) for every vertex v of G. Thomassen proved that if v1, v2 ∈ V (C) are adjacent, L(v1) ̸= L(v2), |L(v)| ≥ 3 for every v ∈ V (C)−{v1, v2} and |L(v)| ≥ 5 for every v ∈ V (G)−V (C), thenG has an L-coloring. What happens when ...
متن کاملSum List Coloring Block Graphs
A graph is f -choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. We characterize f -choosable functions for block graphs (graphs in which each block is a clique, including trees and line graphs of trees). The sum choice number is the minimum over all choosable functions f of the sum of the sizes in f . The sum choice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2012
ISSN: 1077-8926
DOI: 10.37236/2487